Order‐theoretical ranking

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ranking electoral systems through hierarchical properties ranking

Electoral systems are complex entities composed of a set of phases that form a process to which performance parameters can be associated. One of the key points of every electoral system is represented by the electoral formula that can be characterized by a wide spectrum of properties that, according to Arrow’s Impossibility Theorem and other theoretical results, cannot be all satisfied at the s...

متن کامل

Anomaly Ranking as Supervised Bipartite Ranking

The Mass Volume (MV) curve is a visual tool to evaluate the performance of a scoring function with regard to its capacity to rank data in the same order as the underlying density function. Anomaly ranking refers to the unsupervised learning task which consists in building a scoring function, based on unlabeled data, with a MV curve as low as possible at any point. In this paper, it is proved th...

متن کامل

Reinforcement Ranking

We introduce a new framework for web page ranking—reinforcement ranking—that improves the stability and accuracy of Page Rank while eliminating the need for computing the stationary distribution of random walks. Instead of relying on teleportation to ensure a well defined Markov chain, we develop a reverse-time reinforcement learning framework that determines web page authority based on the sol...

متن کامل

Spectral ranking

This note tries to attempt a sketch of the history of spectral ranking—a general umbrella name for techniques that apply the theory of linear maps (in particular, eigenvalues and eigenvectors) to matrices that do not represent geometric transformations, but rather some kind of relationship between entities. Albeit recently made famous by the ample press coverage of Google’s PageRank algorithm, ...

متن کامل

Ranking forests

The present paper examines how the aggregation and feature randomization principles underlying the algorithm Random Forest (Breiman (2001)) can be adapted to bipartite ranking. The approach taken here is based on nonparametric scoring and ROC curve optimization in the sense of the AUC criterion. In this problem, aggregation is used to increase the performance of scoring rules produced by rankin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Society for Information Science

سال: 2000

ISSN: 0002-8231,1097-4571

DOI: 10.1002/(sici)1097-4571(2000)51:7<587::aid-asi2>3.3.co;2-c